Non-liner Great Deluge Algorithm for Handling Nurse Rostering Problem
نویسندگان
چکیده
The optimisation of the nurse rostering problem is chosen in this work due to its importance as an optimisation challenge with an availability to improve the organisation in hospitals duties, also due to its relevance to elevate the health care through an enhancement of the quality in a decision making process. Nurse rostering in the real world is naturally difficult and complex problem. It consists on the large number of demands and requirements that conflicts the hospital workload constraints with the employees work regulations and personal preferences. In this paper, we proposed a modified version of great deluge algorithm (GDA). GDA usually explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original GDA, the water level decreases steadily in a linear technique. In this work, we modified the decay rate of the water level into a nonlinear fashion. Computational results were measured with three complexity levels as a total of 30 variant instances based on real-world constraints.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملAn Efficient Hybrid Algorithm for Nurse Rostering Problem
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle these constraints within genetic algorithm frameworks. In this paper, we investigate an extension of a previously proposed stochastic ranking method, which has demonstrated superior performance to other constraint hand...
متن کاملA Hyperheuristic Approach to Belgian Nurse Rostering Problems
The nurse rostering problem involves the assignment of shifts to nurses with respect to several constraints like workload, legal restrictions, and contractual agreements [9]. The complexity of the problem attracts many researchers around the world. Since the regulations, requirements, and agreements differ from country to country, the models and solution methods differ as well [9]. The solution...
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملHybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem
The nurse rostering problem is an important search problem that features many constraints. In a nurse rostering problem, these constraints are defined by processes such as maintaining work regulations, assigning nurse shifts, and considering nurse preferences. A number of approaches to address these constraints, such as penalty function methods, have been investigated in the literature. We prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017